Efficient spreader for spread spectrum communication systems

ABSTRACT

A spreading system and method for CDMA applications that requires fewer integer multiplications. User data is spread using real or complex integer based spreading codes of length SF to SF max  chips. At least one of the codes is of the form j n •v[n] where v[n] is a spreading code. The invention provides increased user separation using a plurality of spreading codes.

CROSS-REFERENCE TO RELATED APPLICATIONS

[0001] This application claims the benefit of U.S. Provisional Pat. application Ser. No. 60/191,884; filed Mar. 23, 2000.

BACKGROUND

[0002] The present invention relates generally to digital communication systems. More specifically, the invention relates to a system and method for spreading a data signal for spread spectrum communications

[0003] A communication system typically transmits information or data using a continuous frequency carrier with modulation techniques that vary its amplitude, frequency or phase. The information to be transmitted is mapped onto a predetermined constellation that defines symbols and is transmitted over a communication medium. The communication medium may be guided or unguided, (comprising copper, optical fiber or air) and is commonly referred to as the communication channel.

[0004] Deployed communication systems rarely are single access. A prior art multiple-access communication system is shown in FIG. 1. Protocols such as time division multiple access (TDMA), carrier sense multiple access (CSMA), code division multiple access (CDMA) and frequency related protocols such as frequency division multiple access (FDMA) and orthogonal frequency division multiplexing (OFDM) allow a plurality of users to access the same communication media to transmit or receive information. These techniques can be mixed together creating hybrid varieties of multiple-access communication schemes such as time division duplex (TDD). The access protocol specified by a communication system is typically executed after the data undergoes modulation.

[0005] Prior art modulation techniques that are in use are frequency modulation (FM), frequency shift keying (FSK), phase shift keying (PSK), binary phase shift keying (BPSK) and differential phase shift keying (DPSK). The most commonly used high-speed methods for data modulation are quadrature amplitude modulation (QAM) and quadrature phase shift keying (QPSK). These techniques vary a predefined carrier frequency amplitude and phase according to an input signal to transmit multiple bits per baud thereby using available bandwidth more efficiently.

[0006] To extend the possible range of data signal values, quadrature modulation assigns a symbol to represent more than two binary values. The use of a symbol allows for a greater degree of transmitted information since the bit content of each symbol dictates a unique pulse shape. Symbols, which consist of x bits per sample, may represent a quantized version of an analog sample or digital data. Depending upon the number of symbols used, an equal number of unique pulseshapes or waveshapes exist. The number of data bits determine the combinations of amplitude and phase that define a constellation pattern.

[0007] Quadrature modulation is based on two distinct waveforms that are orthogonal to each other. If two waveforms are transmitted simultaneously and do not interfere with each other, they are orthogonal. Quadrature modulation modulates two different signals into the same bandwidth creating a two-dimensional signal space as shown in FIG. 2. Two waveforms generally used for quadrature modulation are sine and cosine waveforms at the same frequency. The waveforms are defined as:

s ₁(t)=Acos(2πf _(c) t)  (1)

[0008] and

s ₂(t)=Asin(2πf _(c) t)  (2)

[0009] where f_(c) is the carrier frequency of the modulated signal and A is the amplitude applied to both signals. By convention, the cosine carrier is called the in-phase (I), real component of the signal and the sine carrier is the quadrature (Q), imaginary component of the signal. Linear combinations of the form α₁ cos(2πf_(c)t)+α₂ sin(2πf_(c)t), (where α₁ and α₂ are real numbers), generated from the two basic waveforms define symbols in the modulation alphabet. The symbols can be represented as complex numbers, a₁+ja₂, where j is defined as j={square root}{square root over (−1)}

[0010] A QAM symbol consists of at least one sample from both the in-phase I and quadrature Q signals. Signal amplitude is indicated by the distance from the origin; phase by the angular distance around the unit circle. After the data is assembled as symbols, the symbols are processed in accordance with an access protocol chosen for the communication system.

[0011] A prior art CDMA communication system is shown in FIG. 3. CDMA is a communication technique in which data is transmitted with a broadened band (spread spectrum) by modulating the data to be transmitted with a pseudo-noise sequence. The data signal to be transmitted may have a bandwidth of only a few thousand Hertz distributed over a frequency band that may be several million Hertz. The communication channel is used simultaneously by k independent subchannels. For each subchannel k, all other subchannels appear as interference.

[0012] As shown, a single subchannel of a given bandwidth is mixed with a unique spreading code which repeats a predetermined pattern generated by a wide bandwidth, pseudo-noise (pn) sequence generator. These unique user spreading codes are typically pseudo-orthogonal to one another such that the cross-correlation between the spreading codes is close to zero. The spreading codes in a CDMA system are chosen to minimize interference between a desired subchannel and all other subchannels. A data signal is multiplied with the pn-sequence to spread the data signal and produce a digital spread spectrum signal. A carrier signal is modulated with the digital spread spectrum signal and transmitted on the communication channel. A receiver demodulates the transmission to extract the digital spread spectrum signal. The transmitted data is reproduced after correlation with the matching pn sequence. When the spreading codes are orthogonal with one another, the received signal can be correlated with a particular user signal related to a particular spreading code such that only the desired user signal related to the particular spreading code is enhanced, while the other signals for all other users are not enhanced.

[0013] Each element of the spreading code is known as a chip and belongs to the set {1, −1}. The chip frequency or rate is the same or faster than the data rate. The ratio between the chip rate and the subchannel data rate is referred to as the spreading factor and is equal to the number of chips that are used to spread one symbol of user data. The number of chips is divisible by the largest spreading factor allowed. The larger the spreading factor, the more resistant a symbol is to noise and interference. For the case of synchronous CDMA, a symbol from the user with the largest spreading factor may constitute an entire block of data.

[0014] CDMA is one access protocol called for in the proposed 3^(rd) generation wireless communication standards. Shown in FIG. 4 is a system architecture of a CDMA spreader making use of variable spreading factors. Variable spreading factors allow a transmitter to fine tune overall system processing gain. Higher data rate users are assigned spreading codes having a lower spreading factor at the expense of reduced processing gain. Lower data rate users are assigned spreading codes having a higher spreading factor. Therefore, the overall bandwidth of the spread signal of all users is maintained to be the same.

[0015] To reduce the overall number of spreading codes for each user in a given communication system, different spreading codes are used for cell separation and user separation, resulting in a two-part spreading operation for each subchannel. Channelization codes are used for user separation and scrambling codes for cell separation. Although a two-part spreading operation is characteristic of cellular CDMA systems, a single spreading operation maybe used in other applications. Here, the channelization and scrambling codes are replaced by a single code that separates each user.

[0016] To effect the spreading operation of k subchannel users in a physical system, linear spreading methods are executed as fixed gate arrays, microprocessors, digital signal processors (DSPs), application specific integrated circuits (ASICs) and the like. Fixed logic systems allow for greater system speed while microprocessor driven systems offer programming flexibility. Either implementation that is responsible for performing the spreading functions perform a sequence of mathematical operations. The following variables typically define the structure and operation of a spreader:

[0017]c=the real integer channelization spreading code presented as a vector for subchannel k corresponding with a given spreading factor SF. The length of the channelization code c varies with different spreading factors SF.

[0018] d=the data transmitted in a subchannel k.

[0019]d=the data in a subchannel k after modulation. The data is presented in the form of a vector, where a vector is an array of data indexed by a single index variable. For the purposes of vector operations which follow, all vectors are defined as column vectors.

[0020] k=one subchannel, (k=1, 2, 3, . . . K).

[0021] N=the number of data symbols in a group of the k^(th) subchannel, (N=SF_(max)|SF). For the case of synchronous CDMA, a symbol from the user with the largest spreading factor may constitute an entire block of data. Each sub channel k has its own group size N where N can equal 1 (for SF=SF_(max)) to SF_(max)|SF_(min).

[0022] i=the i^(th) symbol of data d, (i=1, 2, 3, . . . N).

[0023] n=the element reference of a vector, ([n]).

[0024] SF=the spreading factor of subchannel k.

[0025] SF_(min)=the minimum spreading factor of the communication system.

[0026] SF_(max)=the maximum spreading factor of the communication system.

[0027]v=the real, integer part of the scrambling code. $\overset{\sim}{\underset{\_}{v}} =$

[0028] the complex scrambling code presented as a vector of length SF_(max). {tilde over (v)}[n]=j^(n)•v[n], where n=1 . . . SF_(max). Note that v[n] & {tilde over (v)}[n] reference the n^(th) element of the vectors v & {tilde over (v)}. Thus, v[n]=j^(n)•v[n] defines the rule for deriving the n^(th) element of {tilde over (v)} from the n^(th) element of v.

[0029]z _(i)=the final spread chip sequence resulting from the application of the channelization and scrambling codes on the i^(th) symbol of subchannel k. z_(i)[n]=d_(i)•c[n]•j^(SF(i−1)+n)•v[SF(i+1)+n], where n=1 . . . SF. z, is SF chips long; the spreading factor chosen for that particular subchannel k. N such SF long z _(i) form z of length SF_(max).

[0030] To simplify the description that follows, a two-part, prior art spreader for a k^(th) subchannel is discussed. One skilled in this art appreciates that a plurality of k spread subchannels can be summed as shown in FIG. 4. After data has been modulated, where data d of subchannel k is assembled as symbols defining a predetermined constellation, a sequence of complex data symbols d is divided into groups containing N symbols each, defined by: $\begin{matrix} {N = {\frac{{SF}_{\max}}{SF}.}} & (3) \end{matrix}$

[0031] Each complex data symbol d within a group of N symbols is spread by a real integer channelization code c of length SF chips. The channelization code c is unique to a user k. All N channelization code c spread symbols d of the group N are concatenated.

[0032] The resulting spread symbol sequence SF_(max) chips long is multiplied by a complex scrambling code $\overset{\sim}{\underset{\_}{v}}$

[0033] of length SF_(max) to produce a final chip sequence z of length SF_(max). The scrambling code $\overset{\sim}{\underset{\_}{v}}$

[0034] is derived from a real integer scrambling code v multiplied with a complex operator j^(n). The relation is:

{tilde over (v)}[n]=j^(n)•v[n], where n=1 . . . SF_(max).  (4)

[0035] The result of the two-part spreading process is a vector z of length SF_(max) chips. This vector z can be expressed as a concatenation of N subvectors, z _(i), where i=1, 2, 3, . . . N, where z _(i) is defined as the segment of length SF chips within z that represents the contribution of subchannel k's i^(th) spread symbol, d_(i), in the group. The n^(th) element of z _(i) is given by:

z _(i) [n]=d _(i) •c[n]•j ^(SF(i−1)+n) •v[SF(i+1)+n], where n=1, . . . SF and i=1, 2, 3, . . .   (5)

[0036] v[SF(i+1)+n], where n=1, . . . SF, defines a different set of SF elements of v, starting with the (SF(i−1)+1)^(th) element depending upon i.

[0037] Implementing the two-code spreading operation defined by Equation 5 would require 8(N)(SF) integer multiplications to spread a symbol sequence d of length N symbols for one subchannel k. 2(SF) multiplications are required for the d_(i)•c[n] (where n=1, . . . SF) product (for one symbol) and 2(SF) multiplications are required for the j^(SF(i−1)+n)•v[n] product (for one symbol) (where n=1, . . . SF) since d_(i) and j^(n) are complex numbers multiplied with real numbers. Since both intermediate products are complex, the partial product multiplication requires four operations per symbol yielding a total of 8(N)(SF) multiplications.

[0038] In order to conserve power for operation in a mobile/portable communication system while increasing data throughput, an efficient process is needed to implement multiple code spreading operations.

SUMMARY

[0039] The present invention is a spreading system and method for CDMA applications that requires fewer integer multiplications. User data is spread using real or complex integer-based spreading codes of length SF to SF_(max) chips. At least one of the codes is of the form j^(n)•v[n] where v[n] is a spreading code. The invention provides increased user separation using a plurality of spreading codes.

[0040] Accordingly, it is an object of the invention to provide a less complex system and method for spreading a data signal using more than one spreading code

[0041] Other objects and advantages of the system and method will become apparent to those skilled in the art after reading a detailed description of the preferred embodiment.

BRIEF DESCRIPTION OF THE DRAWING(S)

[0042]FIG. 1 is a simplified block diagram of a prior art multiple access communication system

[0043]FIG. 2 is a plot of a quadrature signal space

[0044]FIG. 3 is a simplified block diagram of a prior art CDMA communication system

[0045]FIG. 4 is a system architecture of a prior art two-part spreader

[0046]FIG. 5 is a system architecture of the present invention.

[0047]FIGS. 6a-d are control flow diagrams of the method of the present invention

[0048]FIGS. 7a-d is a data flow diagram of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT(S)

[0049] The present invention will be described with reference to the drawing figures where like numerals represent like elements throughout

[0050] Shown in FIG. 5 is a system diagram of the spreader 17 of present invention for use in communication systems employing CDMA. The spreader 17 comprises a plurality of processors having collateral memory which perform various vector and matrix operations. Alternate physical embodiments of the invention include fixed gate arrays, ASICs, DSPs and the like performing the equivalent functions of the various processors. As one skilled in this art recognizes, optimization techniques tailored for each physical embodiment may vary when implementing the spreader 17. The spreader 17 also comprises a plurality of data inputs d^((l)) . . . d^((k)) for inputting modulated user data d of subchannel k and an output z ^((Σ)) for outputting a combined spread spectrum signal in the form of an output vector

[0051] To simplify the explanation of the present invention that follows, only one subchannel k spreading operation will be described, thereby eliminating the need for unique subchannel identification throughout. Each data input d^((l)) . . . d⁽k) may have from one to a plurality of channelization codes and from one to a plurality of scrambling codes assigned depending upon the degree of user and cell separation. The terms channelization and scrambling are arbitrary and represent a plurality of spreading codes that vary in length depending upon the assigned spreading factor SF of a subchannel k and the requirements of a communication system. At least one assigned spreading code for each subchannel k must be exclusive to all other codes in the communication system to maintain subchannel separation for each user.

[0052] Each assigned code must have the same length, either as a periodic short code assembly or a code having the maximum spreading factor SF_(max) length. Alternative embodiments of the spreader 17 result from the number of codes assigned for a subchannel k. A plurality of spreaders 17 may be deployed in transmitters for a communication system

[0053] The spreader 17 spreads the data symbols of subchannel k using a plurality of channelization and scrambling codes. These codes may be all real, all complex or some may be real while others may be complex. The spreader 17 comprises an intermediate code generator 21, a group N processor 19, a phaser adjustor 23, a rotator 25, two multipliers 27 r and 27 i and a summer 29

[0054] Recall that length of a code is equal to its spreading factor SF. The intermediate code generator 21 concatenates N periods of each real code of spreading factor SF. It also concatenates N periods of the real part of each complex code of spreading factor SF. Thus each code of spreading factor SF yields a long code of length SF_(max). It then multiplies all of these long codes via an element-by-element multiplication of the resulting vector with all real codes of spreading factor SF_(max) and the real part of all complex codes of length SF_(max). This results in the final output of the intermediate code generator 21, which is a single real code of length SF_(max).

[0055] The group N processor 19 determines the group size N as the ratio SF _(max) and then SF assembles a group of N symbols. The spreader 17 spreads one such group at a time

[0056] The phase adjuster 23, imparts an initial phase to each of the N symbols in the group assembled by the group N processor 19. The phase imparted to a symbol is a function of the position of the symbol within its group. Thus, the output of the phase adjustor 23 is a group of N symbols where each symbol has been given a specific phase rotation

[0057] The rotator 25 accounts for the complex codes by forming a sequence of length SF corresponding to each of these symbols in the group of N symbols obtained from the output of the phase adjustor 23. It does so by rotating each phase-adjusted symbol SF times, with the degree of rotation being a function of the total number of complex codes in the system. Then, the N such complex sequences corresponding to each of the N symbols in the group are concatenated to form a single complex sequence of length N•SF=SF_(max), which forms the final output of the rotator 25

[0058] The complex sequence output of the rotator 25 is multiplied, element-by-element, with the intermediate code generator 21 output. This multiplication is accomplished via the multipliers 27 r and 27 i. The multipliers 27 r and 27 i multiply the real intermediate code with the real and imaginary parts, respectively, of the complex sequence output of the rotator 25

[0059] The output of the multipliers 27 r and 27 i is the final spread sequence of the group of N symbols of a subchannel. The summer 29 adds the final spread sequence of all subchannels to form a single sequence output of the spreader 17

[0060] Since channelization codes are employed for user separation and scrambling codes are employed for cell separation, the channelization code and scrambling codes are known a priori according to cell location and are transmitted to a respective user from a cell base station via a learning transmission. The learning transmission is beyond the scope of this disclosure. M channelization codes are available for use, ${{\overset{\sim}{\underset{\_}{c}}}_{1}\quad \ldots \quad {\overset{\sim}{\underset{\_}{c}}}_{M_{1}}},{{\underset{\_}{c}}_{M_{1 + 1}}\quad \ldots \quad {\underset{\_}{c}}_{M}}$

[0061] of which the first M₁ are complex and the remaining are real. The n^(th) element of the i^(th) complex channelization code is defined as:

{tilde over (c)}_(t)[n]=j^(n)•c_(i)[n],where n=1, . . .SF and where c _(i) is real.  (6)

[0062] The subchannel k also can utilize P scrambling codes, ${{\overset{\sim}{\underset{\_}{v}}}_{1}\quad \ldots \quad {\overset{\sim}{\underset{\_}{v}}}_{P_{1}}},{{\underset{\_}{v}}_{P_{1 + 1}}\quad \ldots \quad {\underset{\_}{v}}_{P}}$

[0063] of which the first P₁ are complex and the remaining are real. The n^(th) element of the i^(th) complex scrambling code is defined as:

{tilde over (v)}_(i)[n]=j^(n)•v_(i)[n], where n=1, . . . SF_(max) and where v _(i) is real.  (7)

[0064] Referring to the flow diagram of the method 97 of the present invention shown on FIGS. 6a-d, data d which has undergone modulation and comprises a series of data symbols is input into the spreader 17. A symbol group size N for subchannel k is determined by the group N processor 19 using Equation 3 (step 99). Since different channelization codes c have different lengths due to their different spreading factors SF, N periods of the respective channelization codes c are concatenated (step 101) to form a periodic long code c _(p), equal in length to the maximum spreading factor SF_(max) of the communication system. Concatenation is not required when N is equal to one (SF=SF_(max))

[0065] In order to simplify the explanation of the method 97, c represents the product of all real channelization codes that have been concatenated c _(p). Included in c are the real codes from which the complex channelization codes are derived. The n^(th) element of c is defined as:

c[n]=c ₁ [n]·c ₂ [n] . . . c _(M) [n], where n=1, . . . SF.  (8)

[0066] Additionally, v represents the product of all real scrambling codes. Included in v are the real codes from which the complex scrambling codes are derived. The n^(th) element of v is defined as:

v[n]=v ₁ [n]·v ₂ [n] . . . v _(p) [n], where n=1, . . . SF _(max).  (9)

[0067] An intermediate real code s is computed (step 103) from each concatenated channelization code sequence c _(p) and the real scrambling code v by performing an element-by-element multiplication of the two vectors in the intermediate code s generator 21. Multiplication is allowed since both vectors are of the same length. The n^(th) element of the intermediate code s is defined by:

s[n]=c _(p) [n]·v[n], where n=1, . . . SF _(max)  (10)

[0068] where c _(p), is a product of the periodic extensions of the subchannel k channelization codes c, containing N periods of c corresponding to the spreading factor SF. Intermediate real code s of length SF_(max) is computed (step 103) using v and c and is made up of M+P real codes.

[0069] The intermediate code s is computed once for a given (k^(th)) subchannel. Efficiency is gained since the computation is performed once for the entire data sequence for transmission of subchannel k. Group N count (step 105) is initialized and a vector d comprising N symbols is assembled (step 107) in the group N processor 19. Symbol d_(i) count is initialized (step 109).

[0070] The spreader 17 improves processing speed by recognizing that the generation of each subsequence z _(i) (Equation 5) involves the complex sequence j^(SF(i−1)+n) where n=1, . . . SF. This sequence arises since each complex code $\overset{\sim}{\underset{\_}{c}},\overset{\sim}{\underset{\_}{v}}$

[0071] is derived from a real scrambling code c, v via multiplication with the complex sequence j^(n) (Equation 4). Referring to Equation 5 and using the commutative property of multiplication, the product of the real channelization codes c _(p) and the real scrambling codes v are available via the intermediate code s (step 103). Equation 5 representing the n^(th) element of z_(i), (where z _(i) is the segment of SF chips within z that represents the contribution of subchannel k's i^(th) spread symbol, d_(i) in the group), becomes:

z _(i) [n]=d ₁ ·c[n]·v[SF(i−1)+n]·j ^((P) ^(₁) ^(M) ^(₁) ^()n)  (11)

[0072] where n=1 . . . SF and i=1, 2, . . . N.

[0073] To complete the spreading process for a group, a multiplication of the intermediate code s with a concatenation of all symbols in the group is required. The spreader 17 of the present invention obviates a plurality of multiplications by recognizing that each multiplication with the complex operator j is equivalent to an anti-clockwise rotation of the multiplicand that varies in the number of degrees. The rotation involves an exchange of the real and imaginary parts with a change of sign. The n^(th) element of {tilde over (d)}_(i) is obtained from a multiplication of its (n−1)^(th) element with the complex operator j^((P) ^(₁) ^(+M) ^(₁) ⁾ and is defined as:

[0074]{tilde over (d)} _(i) [n]=j ^((P) ^(₁) ^(+M) ^(₁) ⁾ {tilde over (d)} _(i) [n−1], where n=1, . . . SF  (12)

[0075] where the O^(th) element of {tilde over (d)}_(i) is initialized as:

{tilde over (d)} ₁[0]=d _(i) j ^(SF(i−1)P) ^(₁)   (13)

[0076] Equation 13 initializes {tilde over (d)}_(i)[0] by imparting an initial phase d_(i), which is a function of the spreading factor SF, the position i within the group of the symbols being spread and the number of complex scrambling codes P₁. Step 111 performs the first step of this initialization.

[0077] Invoking the equivalence between a multiplication with a complex operator j and an anticlockwise rotation of the multiplicand by 90 degrees, the real and imaginary components of the n^(th) element of {tilde over (d)}₁ are derived from the imaginary and real components, respectively, of its (n−1)^(th) element. Since a group of N symbols is spread with N periods of the subchannel k spreading factor SF channelization codes c, i takes the value from i=1, . . . N.

[0078] After a symbol count i is initialized (step 109), a group of N symbols is processed and d_(i)[0] is initialized (step 111). When the spreading factor SF satisfies the following:

SF•P ₁=4q, for any integer p,  (14)

[0079] Equation 12 reduces to {tilde over (d)}_(i) [0]=d _(i) since j^(4q)=1 for any integer q. For the case when SF does not satisfy the condition of Equation 14 (step 113), {tilde over (d)}₁[0] is obtained by imparting an initial phase of {tilde over (d)}₁[0]=j^(SF(i−1)P) ^(₁) {tilde over (d)}₁[0] to the symbol d_(i) (step 115).

[0080] The method 97 proceeds with four tests to determine the amount of symbol rotation required depending upon the number of complex spreading codes in use. For the case when M₁+P₁=4_(p) (step 117), where p is any integer, the real and imaginary components of the n^(th) element of {tilde over (d)}₁ are derived from the real and imaginary components with the complex operator being j^((P) ^(₁) ^(+M) ^(₁) ⁾=1, and its (n−1)^(th) elements as shown by Equations 15 and 16 in step 119. The rotator 25 rotates the (n−1)^(th) element of {tilde over (d)}₁ by 0 degrees to obtain its n^(th) element.

[0081] For the case when M₁+P₁=4p+1 (step 135), where p is any integer, the real and imaginary parts of the n^(th) element of {tilde over (d)}_(i) are derived from the imaginary and real parts with the complex operator being j^((P) ^(₁) ^(+M) ^(₁) ⁾=j, and its (n−1)^(th) elements as shown by Equations 17 and 18 in step 123. The rotator 25 rotates the (n−1)^(th) element of {tilde over (d)}₁ at by 90 degrees anti-clockwise to obtain its n^(th) element.

[0082] For the case when M₁+P₁=4p+2 (step 125), where p is any integer, the real and imaginary parts of the n^(th) element of {tilde over (d)}₁ are derived from the real and imaginary components with the complex operator being j^((P) ^(₁) ^(+M) ^(₁) ⁾=−1, and its (n−1)^(th) element as shown by Equations 19 and 20 in step 127. The rotator 25 rotates the (n−1)^(th) element of d _(i) by 180 degrees anti-clockwise to obtain its n^(th) element.

[0083] For the remaining case when M₁+P₁=4p+3 (step 129), where p is any integer, the real and imaginary parts of the n^(th) element of {tilde over (d)}_(i) are derived from the real and imaginary components with the complex operator being j^((P) ^(₁) ^(+M) ^(₁) ⁾=−j , and its (n−1)^(th) element as shown by Equations 21 and 22 in step 131. The rotator 25 rotates the (n−1)^(th) element of {tilde over (d)}_(i) by 270 degrees anti-clockwise to obtain its n^(th) element.

[0084] The resultant SF chip long intermediate chip sequence {tilde over (d)}_(i) is computed for the i^(th) symbol in the group of N symbols by employing SF rotations as described by Equations 15-22. Actual multiplication is replaced by the rotator 25 performing shift operations shown in FIGS. 7a-d that correspond to the aforementioned 0 degrees, 90 degrees, 180 degrees and 270 degrees rotations respectively to compute the SF chip long vector {tilde over (d)}_(i).

[0085] As shown in the FIGS. 7a-d, at the i^(th) symbol interval, the 0^(th) element of {tilde over (d)}₁ is initialized from the new complex data symbol d _(i) per Equation 13. If the determined amount of symbol rotation is 90 degrees, 180 degrees or 270 degrees, the real and imaginary components of {tilde over (d)}₁[0] are loaded into a register holding the real {tilde over (d)}_(t), _(real)[n] and imaginary {tilde over (d)}₁, _(imag)[n] components of {tilde over (d)}_(i)[n]. The real and imaginary components of {tilde over (d)}₁[n] are shifted around in the register at the chip rate. The register has two memory elements, which together with a feedback path accomplish the derivation of the real and imaginary components of the n^(th) element of {tilde over (d)}₁ from the imaginary and real components, respectively, of its (n−1)^(th) element, (Equations 17-22). The multiplication with −1 accounts for required sign changes. Rotator 25 outputs Z_(real), Z_(imag) tapped at the n^(th) chip interval as ${{{\overset{\sim}{\underset{\_}{d}}}_{i,{real}}\lbrack n\rbrack}\quad {and}\quad {\overset{\sim}{\underset{\_}{d}}}_{i}},$

[0086]_(imag)[n]. Thus, the rotator outputs over n=1, . . . SF chip intervals to represent the SF chip long vector ${\overset{\sim}{\underset{\_}{d}}}_{i},$

[0087] i.e., the product of the data symbol d_(i) with the j^(SF(i−1)+n), n=1, . . . SF.

[0088] As one skilled in the art should realize, a phase rotation of 0 degrees on the complex plane (FIG. 2) implemented by the rotator 25 shown in FIG. 7a outputs the same real ${\overset{\sim}{\underset{\_}{d}}}_{i,{real}}\lbrack n\rbrack$

[0089] and imaginary ${\overset{\sim}{\underset{\_}{d}}}_{i,{imag}}\lbrack n\rbrack$

[0090] component values of the data symbol input. The symbol does not undergo any phase change. A phase rotation of 90 degrees implemented by the rotator 25 shown in FIG. 7b outputs as the imaginary symbol component ${\overset{\sim}{\underset{\_}{d}}}_{i,{imag}}\lbrack n\rbrack$

[0091] the real data symbol component input and outputs as the real symbol component ${\overset{\sim}{\underset{\_}{d}}}_{i,{real}}\lbrack n\rbrack$

[0092] the imaginary symbol component input along with a change of sign. A phase rotation of 180 degrees implemented by the rotator 25 shown in FIG. 7c outputs as the imaginary symbol component ${\overset{\sim}{\underset{\_}{d}}}_{i,{imag}}\lbrack n\rbrack$

[0093] the imaginary data symbol component input along with a change of sign and outputs as the real symbol component ${\overset{\sim}{\underset{\_}{d}}}_{i,{real}}\lbrack n\rbrack$

[0094] the real symbol component input along with a change of sign. A phase rotation of 270 degrees implemented by the rotator 25 in FIG. 7d outputs as the imaginary symbol component ${\overset{\sim}{\underset{\_}{d}}}_{i}$

[0095]_(imag)[n] the imaginary data symbol component input, and outputs as the real symbol component ${\overset{\sim}{\underset{\_}{d}}}_{i}$

[0096]_(real)[n] the real symbol component input along with a change of sign

[0097] Referring to FIG. 6d, after all remaining symbols in the group are similarly processed (step 133), their {tilde over (d)}_(i), i=1 . . . N are concatenated to form SF_(max) long {tilde over (d)}_(i) and then multiplied by the intermediate code s to arrive at the final spread sequence z of the group (step 135). The process is repeated for remaining groups (step 137) and the group index is incremented (step 139) if needed

[0098] Alternative embodiments of spreader 17 may be realized when a specific number of codes are used and do not vary. For example, if the spreader 17 was deployed in transmitters for a communication system that only required two codes for separation, one real and one complex, the total number of complex codes equals one, satisfying the test M₁+P₁=4p+1 (j(^((number of complex codes) modulo 4)))(step 121) thereby requiring only a 90 degree rotation. The remaining tests for 0, 180 and 270 degree rotations (steps 117, 125, 129) and their associated rotations (steps 119, 127 and 131) are obviated. Any number of codes may be combined to spread the data assembled in the group N processor 19

[0099] While the present invention has been described in terms of the preferred embodiments, other variations which are within the scope of the invention as outlined in the claims below will be apparent to those skilled in the art. 

What is claimed is:
 1. A communication system having a spreader for spreading a data signal comprising at least a plurality of data symbols; the system assigning at least one of a plurality of spreading codes where at least one of said plurality of spreading codes is complex, the spreader characterized by: a data input for receiving said data symbol; a control input, for receiving an assigned spreading factor for the data signal; a processor for defining a group of symbols for spreading based upon said assigned spreading factor; an intermediate code generator for computing a spreading code based upon said assigned spreading factor and at least one code from a plurality of real codes derived from said plurality of assigned spreading codes, said intermediate code generator outputting an intermediate code; and a rotator for performing a phase rotation of each symbol in said group to generate a complex quantity, said complex quantity being spread with said intermediate code and output as a spread data signal.
 2. The system of claim 1 wherein said group N processor defines said group using the relationship: $N = \frac{{SF}_{\max}}{SF}$

where N denotes the number of data symbols in said group, SF_(max) denotes the maximum spreading factor of the communication system and SF is the assigned spreading factor of the data signal.
 3. The system of claim 2 wherein the amount of said phase rotation performed by said rotator is dependent upon the total number of assigned spreading codes.
 4. The system of claim 2 wherein said plurality of assigned spreading codes is further characterized by both channelization codes and scrambling codes.
 5. The system of claim 4 further characterized by said channelization codes including complex and real codes and said scrambling codes including complex and real codes.
 6. The system of claim 5 wherein the amount of said phase rotation by said rotator is dependent upon the total number of complex channelization and complex scrambling codes assigned.
 7. The system of claim 6 wherein said phase rotation is further characterized by j^((total number of complex codes)modulo 4) where a remainder of 0 results in 0 degrees of rotation, a remainder of 1 results in 90 degrees of rotation, a remainder of 2 results in 180 degrees of rotation and a remainder of 3 results in 270 degrees of rotation.
 8. A spreader (17) that spreads a plurality of data signals (d ^(k)) in a communication system for transmission assigning at least one of a plurality of spreading codes $\left( {\left( {{{\overset{\sim}{\underset{\_}{c}}}_{1}\quad \ldots \quad {\overset{\sim}{\underset{\_}{c}}}_{M_{1}}},{{\underset{\_}{c}}_{M_{1 + 1}}\quad \ldots \quad {\underset{\_}{c}}_{M}}} \right)\quad {and}\quad \left( {{{\overset{\sim}{\underset{\_}{v}}}_{1}\quad \ldots \quad {\overset{\sim}{\underset{\_}{v}}}_{P_{1}}},{v_{P_{1 + 1}\quad}\ldots \quad {\underset{\_}{\quad v}}_{P}}} \right)} \right)$

for each data signal (d) where at least one of the assigned spreading codes for each data signal (d) from the plurality of spreading codes is complex, the spreader (17) characterized by: a plurality of data inputs for receiving symbols (d _(i)) of the respective data signals (d ^((k))); a plurality of processors (19) each coupled to a respective data input, for recovering an assigned spreading factor and for defining a group N of symbols (d _(i)) for spreading based upon said spreading factor SF; a plurality of intermediate code s generators (21) for computing one spreading code s based upon said assigned spreading factor SF and at least one assigned code (d) from a plurality of real codes ((c ₁ . . . c _(M1), cM₁₊₁ . . . c _(M))) and (v ₁ . . . v _(p1), v _(P1+1) . .. v _(P)) corresponding to the plurality of codes $\left( {\left( {{{\overset{\sim}{\underset{\_}{c}}}_{1}\quad \ldots \quad {\overset{\sim}{\underset{\_}{c}}}_{M_{1}}},{{\underset{\_}{c}}_{M_{1 + 1}}\quad \ldots \quad {\underset{\_}{c}}_{M}}} \right)\quad {and}\quad \left( {{{\overset{\sim}{\underset{\_}{v}}}_{1}\quad \ldots \quad {\overset{\sim}{\underset{\_}{v}}}_{P_{1}}},{v_{P_{1 + 1}\quad}\ldots \quad {\underset{\_}{\quad v}}_{P}}} \right)} \right)$

for a respective data signal, each said intermediate code s generator outputting an intermediate code; plurality of rotators (25), each coupled to a respective output of a processor (19), for performing a phase rotation of each said data input symbol (d _(i)) in said respective group N arriving at a complex quantity $\left( {{{\overset{\sim}{\underset{\_}{d}}}_{i,{real}}\lbrack n\rbrack},{{\overset{\sim}{\underset{\_}{d}}}_{i,{imag}}\lbrack n\rbrack}} \right),$

each said data signal (d) complex group N quantity $\left( {{{\overset{\sim}{\underset{\_}{d}}}_{i,{real}}\lbrack n\rbrack},{{\overset{\sim}{\underset{\_}{d}}}_{i,{imag}}\lbrack n\rbrack}} \right)$

spread with said respective data signal (d) intermediate code s and output as a spread data signal (z) for said respective data signal (d); and a summer (29) for combining all said spread data signals ({tilde over (z)}) into a combined spread signal ({tilde over (z)}^((Σ)) as an output.
 9. The spreader (17) according to claim 8 wherein each said processor (19) defines a group N using the relationship, $N = \frac{{SF}_{\max}}{SF}$

where N denotes the number of data symbols in said group N, SF_(max) denotes the maximum spreading factor of the communication system and SF is the assigned spreading factor of the respective data signal.
 10. The spreader (17) according to claim 9 wherein the amount of said phase rotation performed by said rotator for each said respective data signal (d) is dependent upon the total number of complex spreading codes assigned for said respective data signal (d).
 11. The spreader (17) according to claim 10 whereby said plurality of assigned spreading codes is further characterized by channelization codes $\left( {{{\overset{\sim}{\underset{\_}{c}}}_{1}\quad \ldots \quad {\overset{\sim}{\underset{\_}{c}}}_{M_{1}}},{{\underset{\_}{c}}_{M_{1 + 1}}\quad \ldots \quad {\underset{\_}{c}}_{M}}} \right)$

and scrambling codes $\left( {{{\overset{\sim}{\underset{\_}{v}}}_{1}\quad \ldots \quad {\overset{\sim}{\underset{\_}{v}}}_{P_{1}}},{{\underset{\_}{v}}_{P_{1 + 1}}\quad \ldots \quad {\underset{\_}{v}}_{P}}} \right).$


12. The spreader (17) according to claim 11, whereby said channelization codes $\left( {{{\overset{\sim}{\underset{\_}{c}}}_{1}\quad \ldots \quad {\overset{\sim}{\underset{\_}{c}}}_{M_{1}}},{{\underset{\_}{c}}_{M_{1 + 1}}\quad \ldots \quad {\underset{\_}{c}}_{M}}} \right)$

further include complex and real portions and said scrambling codes $\left( {{{\overset{\sim}{\underset{\_}{v}}}_{1}\quad \ldots \quad {\overset{\sim}{\underset{\_}{v}}}_{P_{1}}},{{\underset{\_}{v}}_{P_{1 + 1}}\quad \ldots \quad {\underset{\_}{v}}_{P}}} \right)$

including complex and real portions.
 13. The spreader (17) according to claim 12 wherein the amount of said phase rotation performed by said rotator for each said respective data signal (d) is dependent upon said total number of complex channelization and complex scrambling codes.
 14. A method of spreading a data signal comprising a plurality of data symbols for transmission in a communication system assigning at least one of a plurality of spreading codes, where at least one of the assigned spreading codes from the plurality of spreading codes is complex, the method characterized by the steps of: (a) computing a spreading factor; (b) defining a group of said symbols for spreading based upon said spreading factor; (c) generating a plurality of real codes corresponding to said plurality of spreading codes; (d) generating an intermediate code based upon said spreading factor and at least one of said real codes; (e) rotating each of said symbols of said group to generate a complex spreading code; and (f) mixing said complex spreading code with said intermediate code to generate an output spreading code.
 15. The method according to claim 14 wherein said defining step is further characterized by the step of deriving the size of said group using the formula: $N = \frac{{SF}_{\max}}{SF}$

where N denotes the number of data symbols in a group, SF_(max) denotes the maximum spreading factor of the communication system and SF is the computed spreading factor.
 16. The method according to claim 15 wherein said rotating step is further characterized by differing degrees of rotation in dependence upon the number of complex spreading codes from said assigned codes.
 17. The method according to claim 16 wherein said rotating step is further characterized by the steps of: (d1) rotating 0 degrees when j^((total number of complex codes)modulo 4) remainder is 1; (d2) rotating 90 degrees when j^((total number of complex codes)modulo 4) remainder is j; (d3) rotating 180 degrees when j^((total number of complex codes)modulo 4) remainder is 1; and (d4) rotating 270 degrees when j^((total number of complex codes)modulo 4) remainder is j.
 18. The method according to claim 17 whereby said plurality of signal spreading codes is further characterized by channelization codes and scrambling codes.
 19. The method according to claim 18 whereby said characterization codes further including complex channelization codes and said scrambling codes further include complex scrambling codes.
 20. The method according to claim 19 further characterized by the step of summing said number of complex channelization codes and complex scrambling codes from said assigned codes. 